An empirical study into COBOL type inferencing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An empirical study into COBOL type inferencing

In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations contained therein, showing how variables are related based on their actual usage. The most problematic aspect of type inference is pollution, the phenomenon that types become too large, and contain variables that intui...

متن کامل

Type Inference for COBOL Systems

Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adequate type system (such as COBOL). To solve this problem, we propose a method of automated type inference for these languages. The main ingredients are that if variables are compared using some relational operator their...

متن کامل

An empirical study into class testability

In this paper we investigate factors of the testability of object-oriented software systems. The starting point is given by a study of the literature to obtain both an initial model of testability and existing object-oriented metrics related to testability. Subsequently, these metrics are evaluated by means of five case studies of commercial and open source Java systems for which JUnit test cas...

متن کامل

Parametric Type Inferencing for Helium

Helium is a compiler for a large subset of Haskell under development at Universiteit Utrecht. A major design criterion is the ability to give superb error messages. This is especially needful for novice functional programmers. In this paper we document the implementation of the Helium type inferencer. For purposes of experimentation with various methods of type inferencing, the type inferencer ...

متن کامل

Type Inferencing Based on Complete Type Specifications

Type speciication completeness is a necessary prerequisite for support of object creating formulae in object calculus leading to formation of new types to be integrated into a type lattice containing the types from which they were formed. The paper shows what conditions should be satissed in order that the inferred types could be correct and what is the systematic way of integration of these ty...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2001

ISSN: 0167-6423

DOI: 10.1016/s0167-6423(01)00015-6